Randomization helps to perform independent tasks reliably
نویسندگان
چکیده
This paper is about algorithms that schedule tasks to be performed in a distributed failure-prone environment, when processors communicate by message-passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. The question how the power of adversaries affects the optimality of randomized algorithmic solutions is among the problems studied. Linearly-bounded adversaries may fail up to a constant fraction of the processors. Weakly-adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure-prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point-to-point messages. A randomized algorithm is developed, that attains both O(n log∗ n) expected work and O(n log∗ n) expected communication, against weakly-adaptive linearly-bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with the performance of algorithms against strongly-adaptive linearly-bounded adversaries, that has to be Ω(n log n/ log log n) in terms of work.
منابع مشابه
Implementation of Ergonomic Interventions using Participatory Program Method of PErforM
Background and Objectives: Exposure limit of employees with ergonomic risk factors should be managed based on domestic and international laws and regulations. Manual tasks are tasks due to which a person is required to use part of the body to lift, lower, push, pull, carry and hold the material. The purpose of this study was to introduce ergonomics with the implementation of the PErforM Partici...
متن کاملDe-Randomizing BPP: The State of the Art
The introduction of randomization into e cient computation has been one of the most fertile and useful ideas in computer science. In cryptography and asynchronous computing, randomization makes possible tasks that are impossible to perform deterministically. Even for function computation, many examples are known in which randomization allows considerable savings in resources like space and time...
متن کاملRandomization in Robot Tasks
This article explores the role of randomization in the solution of robot manipulation tasks. Randomization refers to the random selection and execution of an action from a collection of possible actions. The intention is that this collection contains some actions that are useful for making progress toward accomplishing a task, but that the precise identity of these useful actions is unknown. Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 24 شماره
صفحات -
تاریخ انتشار 2004